On Random Search Using Binary Systems Derived from Finite Projective Planes~' @bullet on Rtt-jdom Search Using Binary Systetits Derived Frq"v1 Finite Projective Plpnes

SUMMARY If the points of a finite projective plane with s+l points on a line are identified with the elements of the basic set Sn of search and the lines with the functions of a system F of search, then the incidence matrix of the plane defines a separating system of search on F. Bounds on probabilities of termination of search processes when functions are chosen by random sampling with replacement from the line set have been worked out using combinatorial properties of the point-line incidence in a finite projective plane, relevant to search. This extends the results on PG(2,2) and PG(2,3) search systems earlier obtained by Chakravarti and Manglik [1].